A New Tight Upper Bound on the Transposition Distance
نویسنده
چکیده
We study the problem of computing the minimal number of adjacent, non-intersecting block interchanges required to transform a permutation into the identity permutation. In particular, we use the graph of a permutation to compute that number for a particular class of permutations in linear time and space, and derive a new tight upper bound on the so-called transposition distance.
منابع مشابه
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملUpper Bounds for Sorting Permutations with a Transposition Tree
An upper bound for sorting permutations with an operation estimates the diameter of the corresponding Cayley graph and an exact upper bound equals the diameter. Computing tight upper bounds for various operations is of theoretical and practical (e.g. interconnection networks, genetics) interest. Akers and Krishnamurthy gave a Ω(n! n) time method that examines n! permutations to compute an upper...
متن کاملA new interval approach for setting the distance relay zones to achieve perfect selectivity and maximum sensitivity
In this paper, an interval approach is presented to achieve perfect selectivity and maximum sensitivity in distance relay zones, considering uncertainties. For this purpose, first, the uncertainties affecting the settings of the three zones of a distance relay are discussed. Then, by using the Monte-Carlo simulation, the uncertainties are modelled and the impedances seen by the distance relay a...
متن کاملA new interval approach for setting the distance relay zones to achieve perfect selectivity and maximum sensitivity
In this paper, an interval approach is presented to achieve perfect selectivity and maximum sensitivity in distance relay zones, considering uncertainties. For this purpose, first, the uncertainties affecting the settings of the three zones of a distance relay are discussed. Then, by using the Monte-Carlo simulation, the uncertainties are modelled and the impedances seen by the distance relay a...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کامل